Random walk on the incipient infinite cluster on trees
نویسندگان
چکیده
Let G be the incipient infinite cluster (IIC) for percolation on a homogeneous tree of degree n0 +1. We obtain estimates for the transition density of the the continuous time simple random walk Y on G; the process satisfies anomalous diffusion and has spectral dimension 4 3 . 2000 MSC. Primary 60K37; Secondary 60J80, 60J35.
منابع مشابه
Random walk on the incipient infinite cluster for oriented percolation in high dimensions
We consider simple random walk on the incipient infinite cluster for the spread-out model of oriented percolation on Zd × Z+. In dimensions d > 6, we obtain bounds on exit times, transition probabilities, and the range of the random walk, which establish that the spectral dimension of the incipient infinite cluster is 4 3 , and thereby prove a version of the Alexander– Orbach conjecture in this...
متن کاملInfinite canonical super-Brownian motion and scaling limits
We construct a measure valued Markov process which we call infinite canonical superBrownian motion, and which corresponds to the canonical measure of super-Brownian motion conditioned on non-extinction. Infinite canonical super-Brownian motion is a natural candidate for the scaling limit of various random branching objects on Zd when these objects are (a) critical; (b) mean-field and (c) infini...
متن کاملCollisions of Random Walks
A recurrent graph G has the infinite collision property if two independent random walks on G, started at the same point, collide infinitely often a.s. We give a simple criterion in terms of Green functions for a graph to have this property, and use it to prove that a critical Galton-Watson tree with finite variance conditioned to survive, the incipient infinite cluster in Z with d ≥ 19 and the ...
متن کاملInvasion percolation on regular trees
We consider invasion percolation on a rooted regular tree. For the infinite cluster invaded from the root, we identify the scaling behaviour of its r-point function for any r ≥ 2 and of its volume both at a given height and below a given height. In addition, we derive scaling estimates for simple random walk on the cluster starting from the root. We find that while the power laws of the scaling...
متن کاملOn the Speed of Random Walks on a Percolation Cluster of Trees
We consider the simple random walk on the infinite cluster of the Bernoulli bond percolation of trees, and investigate the relation between the speed of the simple random walk and the retaining probability by studying three classes of trees. A sufficient condition is established for Galton-Watson trees.
متن کامل